Arithmetic Sequential Graceful Labeling on Star Related Graphs
نویسندگان
چکیده
Objectives: To identify a new family of Arithmetic sequential graceful graphs. Methods: The methodology involves mathematical formulation for labeling the vertices given graph and subsequently establishing that these formulations give rise to arithmetic labeling. Findings: In this study, we analyzed some star related graphs namely Star graph, Ustar, t-star, double proved possess Novelty: Here, introduced called Keywords: graph; t-star; U-star; Graceful labeling; Double
منابع مشابه
Graceful and odd graceful labeling of some graphs
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
متن کاملA Conjecture on Amalgamation of Graceful Graphs with Star Graphs
In this paper, we have identified some of the graceful graphs which are obtained from the amalgamations of two graceful graphs. A conjecture is also discussed for general graceful graphs and the same is proved for Fibonacci graceful graphs. Mathematics Subject Classification: 05C78
متن کاملOdd Graceful Labeling of Acyclic Graphs
Let G = (V, E) be a finite, simple and undirected graph. A graph G with q edges is said to be odd-graceful if there is an injection f : V (G) → {0, 1, 2, . . . , 2q− 1} such that, when each edge xy is assigned the label |f (x)− f (y)| , the resulting edge labels are {1, 3, 5, . . . , 2q− 1} and f is called an odd graceful labeling of G. Motivated by the work of Z. Gao [6] in which he studied th...
متن کاملSquare Graceful Labeling of Some Graphs
A p. q graph G = V,E is said to be a square graceful graph ifthere exists an injective function f: V G → 0,1,2,3,... , q such that the induced mapping fp : E G → 1,4,9,... , q 2 defined by fp uv = f u − f v is an injection. The function f is called a square graceful labeling of G. In this paper the square graceful labeling of the caterpillar S X1,X2 ,... ,Xn , the graphs Pn−1 1,2,...n ,mK1,n ∪ ...
متن کاملEven Sequential Harmonious Labeling On Path and Cycle Related Graphs
In this paper, we have shown that collection of paths P i n where n is odd, cycle, triangular snake, quadrilateral snake, P 2 n are even sequential harmonious graph and also we prove that the cycle Cn be a cycle u1, u2, · · · , un is an even sequential harmonious graph. Let G be a graph with V (G) = V (Cn) ∪ {wi : 1 ≤ i ≤ n}, E(G) = E(Cn) ∪ {uiwiui−1wi : 1 ≤ i ≤ n}, then G is an even sequential...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian journal of science and technology
سال: 2022
ISSN: ['0974-5645', '0974-6846']
DOI: https://doi.org/10.17485/ijst/v15i44.1863